System identification using evolutionary Markov chain Monte Carlo

نویسندگان

  • Byoung-Tak Zhang
  • Dong-Yeon Cho
چکیده

System identi®cation involves determination of the functional structure of a target system that underlies the observed data. In this paper, we present a probabilistic evolutionary method that optimizes system architectures for the iden-ti®cation of unknown target systems. The method is distinguished from existing evolutionary algorithms (EAs) in that the individuals are generated from a probability distribution as in Markov chain Monte Carlo (MCMC). It is also distinguished from conventional MCMC methods in that the search is population-based as in standard evolutionary algorithms. The e€ectiveness of this hybrid of evolutionary computation and MCMC is tested on a practical problem, i.e., evolving neural net architectures for the identi®cation of nonlinear dynamic systems. Experimental evidence supports that evolutionary MCMC (or eMCMC) exploits the eciency of simple evolutionary algorithms while maintaining the robustness of MCMC methods and outperforms either approach used alone.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EVOLUTIONARY MONTE CARLO: APPLICATIONS TO Cp MODEL SAMPLING AND CHANGE POINT PROBLEM

Motivated by the success of genetic algorithms and simulated annealing in hard optimization problems, the authors propose a new Markov chain Monte Carlo (MCMC) algorithm called an evolutionary Monte Carlo algorithm. This algorithm has incorporated several attractive features of genetic algorithms and simulated annealing into the framework of MCMC. It works by simulating a population of Markov c...

متن کامل

A Bayesian – Decision Theoretic Approach to Model Error Modeling

This paper takes a Bayesian-decision theoretic approach to transfer function estimation, nominal model estimation, and quantification of the resulting model error. Consistency of the nonparametric estimate of the transfer function is proved together with a rate of convergence. The required quantities can be computed routinely using reversible jump Markov chain Monte Carlo methods. The proposed ...

متن کامل

Bayesian Phylogenetic Inference from Animal Mitochondrial Genome Arrangements

The determination of evolutionary relationships is a fundamental problem in evolutionary biology. Genome arrangement data is potentially more informative than DNA sequence data for inferring evolutionary relationships among distantly related taxa. We describe a Bayesian framework for phylogenetic inference from mitochondrial genome arrangement data using Markov chain Monte Carlo methods. We app...

متن کامل

Bayesian System Identification of MDOF Nonlinear Systems using Highly Informative Training Data

The aim of this paper is to utilise the concept of ‘highly informative training data’ such that, using Markov chain Monte Carlo (MCMC) methods, one can apply Bayesian system identification to multi-degree-offreedom nonlinear systems with relatively little computational cost. Specifically, the Shannon entropy is used as a measure of information content such that, by analysing the information con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Systems Architecture

دوره 47  شماره 

صفحات  -

تاریخ انتشار 2001